Mathematical Grounds of Automata Theory
نویسنده
چکیده
1 1 Warning! These notes are just a draft. They contain errors, unproved statements and a large part of the material is still missing. Introduction This course is an introduction to the algebraic foundations of automata theory. They are built on semigroup theory, a part of algebra which is usually not part of the standard background of a student in mathematics or in computer science. For this reason, an important part of these notes is devoted to an introduction to semigroup theory. A few words on notation. I use Greek letters for functions, lower case letters for elements, capital letters for sets and cursive letters for sets of sets. Thus I write: " let s be an element of a semigroup S and let P(S) be the set of subsets of S ". I write functions on the left and transformations and actions on the right. I use the term morphism for homomorphism. Alphabets are usually denoted by A or B and letters by a, b, c,. . .
منابع مشابه
Multidimensional fuzzy finite tree automata
This paper introduces the notion of multidimensional fuzzy finite tree automata (MFFTA) and investigates its closure properties from the area of automata and language theory. MFFTA are a superclass of fuzzy tree automata whose behavior is generalized to adapt to multidimensional fuzzy sets. An MFFTA recognizes a multidimensional fuzzy tree language which is a regular tree language so that for e...
متن کاملReduction of Computational Complexity in Finite State Automata Explosion of Networked System Diagnosis (RESEARCH NOTE)
This research puts forward rough finite state automata which have been represented by two variants of BDD called ROBDD and ZBDD. The proposed structures have been used in networked system diagnosis and can overcome cominatorial explosion. In implementation the CUDD - Colorado University Decision Diagrams package is used. A mathematical proof for claimed complexity are provided which shows ZBDD ...
متن کاملAutomata: From Uncertainty to Quantum
Automata are simple mathematical objects with unexpected computational, mathematical, modelling and explanatory capabilities. This paper examines some relations between automata and physics. Automata will be used to model quantum uncertainty and quantum computation. Finally, mathematical proofs will be discussed from the perspective of quantum automata. 1 Modelling Quantum Uncertainty with Auto...
متن کاملGAME OF COORDINATION FOR BACTERIAL PATTERN FORMATION: A FINITE AUTOMATA MODELLING
In this paper, we use game theory to describe the emergence of self-organization and consequent pattern formation through communicative cooperation in Bacillus subtilis colonies. The emergence of cooperative regime is modelled as an n-player Assurance game, with the bacterial colonies as individual players. The game is played iteratively through cooperative communication, and mediated by exchan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008